Using simulated annealing algorithm for optimization of quay cranes and automated guided vehicles scheduling
نویسندگان
چکیده
Sea port container terminals play an important role in the national and regional economy. The integrated scheduling of handling equipment has been recently investigated in literature to improve the performance of the container terminals. In this paper, an integrated scheduling of quay cranes and automated guided vehicles is formulated as a mixed integer linear programming model. This model minimizes the makespan of all the loading and unloading tasks for a set of cranes in a scheduling problem. Based on the simulated annealing (SA) algorithm, a scheduling method is proposed to solve the problem in a relatively short period of time. Comparison of the respective results of the mathematical model and the SA algorithm evidently shows acceptable performance of the proposed SA algorithm in finding good solutions for practical scheduling problems. Moreover, the effects of three cooling processes and two sets of control parameters on the best solution of the SA are investigated.
منابع مشابه
Quay Cranes and Yard Trucks Scheduling Problem at Container Terminals
A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...
متن کاملA genetic algorithm for optimization of integrated scheduling of cranes, vehicles, and storage platforms at automated container terminals
Commonly in container terminals, the containers are stored in yards on top of each other using yard cranes. The split-platform storage/retrieval system (SP-AS/RS) has been invented to store containers more efficiently and to access them more quickly. The integrated scheduling of quay cranes, automated guided vehicles and handling platforms in SP-AS/RS has been formulated and solved using the si...
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملAddressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm
Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...
متن کامل